package leetcode.code0064;

import leetcode.IDebug;
import leetcode.helper.HelpDebug;

public abstract class Solution64 implements IDebug {

	public abstract int minPathSum(int[][] grid);

	@Override
	public void debug1() {
		String str = "[[1,3,1],[1,5,1],[4,2,1]]";
		int[][] grid = HelpDebug.str2array1(str);
		int e = 7;
		int r = this.minPathSum(grid);
		HelpDebug.compare(e, r);
	}

	@Override
	public void debug2() {
		String str = "[[1,2,3],[4,5,6]]";
		int[][] grid = HelpDebug.str2array1(str);
		int e = 12;
		int r = this.minPathSum(grid);
		HelpDebug.compare(e, r);
	}

	@Override
	public void debug3() {
		// TODO Auto-generated method stub

	}

	@Override
	public void debug4() {
		// TODO Auto-generated method stub

	}

}
